Examples of Adaptive MCMC by Gareth
نویسندگان
چکیده
We investigate the use of adaptive MCMC algorithms to automatically tune the Markov chain parameters during a run. Examples include the Adaptive Metropolis (AM) multivariate algorithm of Haario et al. (2001), Metropolis-within-Gibbs algorithms for non-conjugate hierarchical models, regionally adjusted Metropolis algorithms, and logarithmic scalings. Computer simulations indicate that the algorithms perform very well compared to nonadaptive algorithms, even in high dimension.
منابع مشابه
Examples of Adaptive MCMC by
We investigate the use of adaptive MCMC algorithms to automatically tune the Markov chain parameters during a run. Examples include the Adaptive Metropolis (AM) multivariate algorithm of Haario et al. (2001), Metropolis-within-Gibbs algorithms for non-conjugate hierarchical models, regionally adjusted Metropolis algorithms, and logarithmic scalings. Computer simulations indicate that the algori...
متن کاملExamples of Adaptive MCMC
We investigate the use of adaptive MCMC algorithms to automatically tune the Markov chain parameters during a run. Examples include the Adaptive Metropolis (AM) multivariate algorithm of Haario et al. (2001), Metropolis-within-Gibbs algorithms for non-conjugate hierarchical models, regionally adjusted Metropolis algorithms, and logarithmic scalings. Computer simulations indicate that the algori...
متن کاملCoupling and Ergodicity of Adaptive MCMC
We consider basic ergodicity properties of adaptive MCMC algorithms under minimal assumptions, using coupling constructions. We prove convergence in distribution and a weak law of large numbers. We also give counter-examples to demonstrate that the assumptions we make are not redundant.
متن کاملOn the Containment Condition for Adaptive Markov Chain Monte Carlo Algorithms
This paper considers ergodicity properties of certain adaptive Markov chain Monte Carlo (MCMC) algorithms for multidimensional target distributions, in particular Adaptive Metropolis and Adaptive Metropoliswithin-Gibbs. It was previously shown by Roberts and Rosenthal (2007) that Diminishing Adaptation and Containment imply ergodicity of adaptive MCMC. We derive various sufficient conditions to...
متن کاملAn ergodicity result for Adaptive Langevin Algorithms
We consider a class of adaptive MCMC algorithms using a Langevintype proposal density. We prove that these are algorithms are ergodic when the target density has exponential tail behaviour. Unlike previous results, our approach does not require bounding the drift function.
متن کامل